Continuous Regularized Least Squares Polynomial Approximation on the Sphere
نویسندگان
چکیده
منابع مشابه
Moving Least Squares Approximation on the Sphere
We introduce moving least squares approximation as an approximation scheme on the sphere. We prove error estimates and approximation orders. Finally, we show certain numerical results. x1. Introduction Recently, approximation on the sphere has become important because of its obvious applications to Meteorology, Oceanography and Geoscience and Geo-engineering in general. Over the last years seve...
متن کاملLeast-squares polynomial approximation
We construct symmetric polar WAMs (Weakly Admissible Meshes) with low cardinality for least-squares polynomial approximation on the disk. These are then mapped to an arbitrary triangle. Numerical tests show that the growth of the least-squares projection uniform norm is much slower than the theoretical bound, and even slower than that of the Lebesgue constant of the best known interpolation poi...
متن کاملThe Sensitivity of Least Squares Polynomial Approximation
Given integers N n 0, we consider the least squares problem of nding the vector of coeecients ~ P with respect to a polynomial basis P N j=0 wn(zj) 2 jf(zj) ? P (zj)j 2. Here a perturbation of the values f(zj) leads to some perturbation of the coeecient vector ~ P. We denote by n the maximal magniication of relative errors, i.e., the Euclidean condition number of the underlying weighted Vanderm...
متن کاملRegularized Least Squares Approximation over the Unit Sphere by Using Spherical Designs
In this talk, starting with some earlier results, we propose and analyze an alternate approach of optimal L2error estimates for semidiscrete Galerkin approximations to a second order linear parabolic initial and boundary value problem with rough initial data. Our analysis is based on energy arguments without using parabolic duality. Further, it follows the spirit of the proof technique used for...
متن کاملRegularized Least-Squares Classification
We consider the solution of binary classification problems via Tikhonov regularization in a Reproducing Kernel Hilbert Space using the square loss, and denote the resulting algorithm Regularized Least-Squares Classification (RLSC). We sketch the historical developments that led to this algorithm, and demonstrate empirically that its performance is equivalent to that of the well-known Support Ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2020
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2020/9172385